Packing <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e96" altimg="si24.svg"><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>4</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-coloring of subcubic outerplanar graphs

For 1≤s1≤s2≤…≤sk and a graph G, packing (s1,s2,…,sk)-coloring of G is partition V(G) into sets V1,V2,…,Vk such that, for each 1≤i≤k the distance between any two distinct x,y∈Vi at least si+1. The chromatic number, χp(G), smallest k that has (1,2,…,k)-coloring. It known there are trees maximum degree 4 subcubic graphs with arbitrarily large χp(G). Recently, was series papers on (s1,s2,…,sk)-colorings in various classes. We show every 2-connected outerplanar (1,1,2)-coloring (1,1,2,4)-colorable. Our results sharp sense not (1,1,3)-colorable (1,1,2,5)-colorable. also (1,2,2,4)-colorable (1,1,3,4)-colorable.